Product recognition in store shelves as a sub-graph isomorphism problem

The arrangement of products in store shelves is carefully planned to maximize sales and keep customers happy. However, verifying compliance of real shelves to the ideal layout is a costly task routinely performed by the store personnel. In this paper, we propose a computer vision pipeline to recognize products on shelves and verify compliance to the planned layout. We deploy local invariant features together with a novel formulation of the product recognition problem as a sub-graph isomorphism between the items appearing in the given image and the ideal layout. This allows for auto-localizing the given image within the aisle or store and improving recognition dramatically.Comment: Slightly extended version of the paper accepted at ICIAP 2017. More information @project_page --> http://vision.disi.unibo.it/index.php?option=com_content&view=article&id=111&catid=7

Replicate Periodic Windows in the Parameter Space of Driven Oscillators

In the bi-dimensional parameter space of driven oscillators, shrimp-shaped periodic windows are immersed in chaotic regions. For two of these oscillators, namely, Duffing and Josephson junction, we show that a weak harmonic perturbation replicates these periodic windows giving rise to parameter regions correspondent to periodic orbits. The new windows are composed of parameters whose periodic orbits have periodicity and pattern similar to stable and unstable periodic orbits already existent for the unperturbed oscillator. These features indicate that the reported replicate periodic windows are associated with chaos control of the considered oscillators

Complete Genome Sequence Of A Vaccinal Newcastle Disease Virus Strain Isolated From An Owl (rhinoptynx Clamator)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)A Newcastle disease virus (NDV) was isolated in chicken embryonated eggs after detection by real-time reverse transcription- PCR (RRT-PCR) from a captive owl swab. The complete genome sequence of APMV-1/Rhinoptynx clamator/Brazil/22516/2009 (APMV-1, avian paramyxovirus type 1) was obtained using Illumina sequencing. Phylogenetic analysis of the complete genome classified the isolate within NDV class II genotype II. © 2016 Van Borm et al.46CNPq, Conselho Nacional de Desenvolvimento Científico e TecnológicoConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq

Experimental Evaluation of Subgraph Isomorphism Solvers

International audienceSubgraph Isomorphism (SI) is an NP-complete problem which is at the heart of many structural pattern recognition tasks as it involves finding a copy of a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI. SI is also widely studied in the constraint programming community, and many constraint-based SI solvers have been proposed since Ullman, such as LAD and Glasgow, for example. All these SI solvers can solve very quickly some large SI instances, that involve graphs with thousands of nodes. However, McCreesh et al. have recently shown how to randomly generate SI instances the hardness of which can be controlled and predicted, and they have built small instances which are computationally challenging for all solvers. They have also shown that some small instances, which are predicted to be easy and are easily solved by constraint-based solvers, appear to be challenging for VF2 and VF3. In this paper, we widen this study by considering a large test suite coming from eight benchmarks. We show that, as expected for an NP-complete problem, the solving time of an instance does not depend on its size, and that some small instances coming from real applications are not solved by any of the considered solvers. We also show that, if RI and VF3 can solve very quickly a large number of easy instances, for which Glasgow or LAD need more time, they fail at solving some other instances that are quickly solved by Glasgow or LAD, and they are clearly outperformed by Glasgow on hard instances. Finally, we show that we can easily combine solvers to take benefit of their complementarity

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

This registry entry contains a reference to the code, data and experimental scripts needed to reproduce the subgraph isomorphism paper: Ciaran McCreesh and Patrick Prosser, "A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs". To appear at the 21st International Conference on Principles and Practice of Constraint Programming (CP 2015)

Proton-Binding Sites of Acid-Sensing Ion Channel 1

Acid-sensing ion channels (ASICs) are proton-gated cation channels that exist throughout the mammalian central and peripheral nervous systems. ASIC1 is the most abundant of all the ASICs and is likely to modulate synaptic transmission. Identifying the proton-binding sites of ASCI1 is required to elucidate its pH-sensing mechanism. By using the crystal structure of ASIC1, the protonation states of each titratable site of ASIC1 were calculated by solving the Poisson-Boltzmann equation under conditions wherein the protonation states of all these sites are simultaneously in equilibrium. Four acidic-acidic residue pairs—Asp238-Asp350, Glu220-Asp408, Glu239-Asp346, and Glu80-Glu417—were found to be highly protonated. In particular, the Glu80-Glu417 pair in the inner pore was completely protonated and possessed 2 H+, implying its possible importance as a proton-binding site. The pKa of Glu239, which forms a pair with a possible pH-sensing site Asp346, differs among each homo-trimer subunit due to the different H-bond pattern of Thr237 in the different protein conformations of the subunits. His74 possessed a pKa of ≈6–7. Conservation of His74 in the proton-sensitive ASIC3 that lacks a residue corresponding to Asp346 may suggest its possible pH-sensing role in proton-sensitive ASICs

The effect of distractions in the operating room during endourological procedures

Contains fulltext : 98421.pdf (publisher's version ) (Closed access)BACKGROUND: Professionals working in the operating room (OR) are subject to various distractions that can be detrimental to their task performance and the quality of their work. This study aimed to quantify the frequency, nature, and effect on performance of (potentially) distracting events occurring during endourological procedures and additionally explored urologists' and residents' perspectives on experienced ill effects due to distracting factors. METHODS: First, observational data were collected prospectively during endourological procedures in one OR of a teaching hospital. A seven-point ordinal scale was used to measure the level of observed interference with the main task of the surgical team. Second, semistructured interviews were conducted with eight urologists and seven urology residents in two hospitals to obtain their perspectives on the impact of distracting factors. RESULTS: Seventy-eight procedures were observed. A median of 20 distracting events occurred per procedure, which corresponds to an overall rate of one distracting event every 1.8 min. Equipment problems and procedure-related and medically irrelevant communication were the most frequently observed causes of interruptions and identified as the most distracting factors in the interviews. Occurrence of distracting factors in difficult situations requiring high levels of concentration was perceived by all interviewees as disturbing and negatively impacting performance. The majority of interviewees (13/15) thought distracting factors impacted more strongly on residents' compared to urologists' performance due to their different levels of experience. CONCLUSION: Distracting events occur frequently in the OR. Equipment problems and communication, the latter both procedure-related and medically irrelevant, have the largest impact on the sterile team and regularly interrupt procedures. Distracting stimuli can influence performance negatively and should therefore be minimized. Further research is required to determine the direct effect of distraction on patient safety

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma

Plastisol Foaming Process. Decomposition of the Foaming Agent, Polymer Behavior in the Corresponding Temperature Range and Resulting Foam Properties

The decomposition of azodicarbonamide, used as foaming agent in PVC - plasticizer (1/1) plastisols was studied by DSC. Nineteen different plasticizers, all belonging to the ester family, two being polymeric (polyadipates), were compared. The temperature of maximum decomposition rate (in anisothermal regime at 5 K min-1 scanning rate), ranges between 434 and 452 K. The heat of decomposition ranges between 8.7 and 12.5 J g -1. Some trends of variation of these parameters appear significant and are discussed in terms of solvent (matrix) and viscosity effects on the decomposition reactions. The shear modulus at 1 Hz frequency was determined at the temperature of maximum rate of foaming agent decomposition, and differs significantly from a sample to another. The foam density was determined at ambient temperature and the volume fraction of bubbles was used as criterion to judge the efficiency of the foaming process. The results reveal the existence of an optimal shear modulus of the order of 2 kPa that corresponds roughly to plasticizer molar masses of the order of 450 ± 50 g mol-1. Heavier plasticizers, especially polymeric ones are too difficult to deform. Lighter plasticizers such as diethyl phthalate (DEP) deform too easily and presumably facilitate bubble collapse